- Notifications
You must be signed in to change notification settings - Fork 5.8k
/
Copy path784. Letter Case Permutation_test.go
62 lines (49 loc) · 955 Bytes
/
784. Letter Case Permutation_test.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
package leetcode
import (
"fmt"
"testing"
)
typequestion784struct {
para784
ans784
}
// para 是参数
// one 代表第一个参数
typepara784struct {
onestring
}
// ans 是答案
// one 代表第一个答案
typeans784struct {
one []string
}
funcTest_Problem784(t*testing.T) {
qs:= []question784{
{
para784{"mQe"},
ans784{[]string{"mqe", "mqE", "mQe", "mQE", "Mqe", "MqE", "MQe", "MQE"}},
},
{
para784{"C"},
ans784{[]string{"c", "C"}},
},
{
para784{"a1b2"},
ans784{[]string{"a1b2", "a1B2", "A1b2", "A1B2"}},
},
{
para784{"3z4"},
ans784{[]string{"3z4", "3Z4"}},
},
{
para784{"12345"},
ans784{[]string{"12345"}},
},
}
fmt.Printf("------------------------Leetcode Problem 784------------------------\n")
for_, q:=rangeqs {
_, p:=q.ans784, q.para784
fmt.Printf("【input】:%v 【output】:%v\n", p, letterCasePermutation1(p.one))
}
fmt.Printf("\n\n\n")
}